Unifying Instance - Based and Rule - Based Induction
نویسنده
چکیده
Several well-developed approaches to inductive learning now exist, but each has speci c limitations that are hard to overcome. Multi-strategy learning attempts to tackle this problem by combining multiple methods in one algorithm. This article describes a uni cation of two widely-used empirical approaches: rule induction and instance-based learning. In the new algorithm, instances are treated as maximally speci c rules, and classi cation is performed using a best-match strategy. Rules are learned by gradually generalizing instances until no improvement in apparent accuracy is obtained. Theoretical analysis shows this approach to be e cient. It is implemented in the RISE 3.1 system. In an extensive empirical study, RISE consistently achieves higher accuracies than state-of-the-art representatives of both its parent approaches (PEBLS and CN2), as well as a decision tree learner (C4.5). Lesion studies show that each of RISE's components is essential to this performance. Most signi cantly, in 14 of the 30 domains studied, RISE is more accurate than the best of PEBLS and CN2, showing that a signi cant synergy can be obtained by combining multiple empirical methods.
منابع مشابه
Unifying Theories of Objects
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operational small-step evaluation rule semantics, and a corresponding UTP model with a denotational relational predicate semantics. For clarity, the UTP model is defined in terms of an operand stack, which is used to store the ...
متن کاملNoise-Tolerant Rule induction from Multi-Instance data
This paper addresses the issue of multipleinstance induction of rules in the presence of noise. It first proposes a multiple-instance extensions of rule-based learning algorithms. Then, it shows what kind of noise can appear in multiple-instance data, and how to handle it theoretically. Finally, it describes the implementation of such a noise-tolerant multiple instance learner, and shows its pe...
متن کاملUsing Induced Rules as Complex Features in Memory-Based Language Learning
An extension to memory-based learning is described in which automatically induced rules are used as binary features. These features have an "active" value when the left-hand side of the underlying rule applies to the instance. The RIPPER rule induction algorithm is adopted for the selection of the underlying rules. The similarity of a memory instance to a new instance is measured by taking the ...
متن کاملAdvances in Inductive Rule Learning
A extension to the k-nearest neighbor classifier is described in which automatically induced rules are used as binary features, which are active in an instance when the left-hand side of the corresponding rule matches with the instance. The ripper rule induction algorithm is employed to produce the rules. The similarity between a memory instance and a new instance is based on the rules the two ...
متن کاملMining Soft-Matching Rules from Textual Data
Text mining concerns the discovery of knowledge from unstructured textual data. One important task is the discovery of rules that relate specific words and phrases. Although existing methods for this task learn traditional logical rules, soft-matching methods that utilize word-frequency information generally work better for textual data. This paper presents a rule induction system, TEXTRISE, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996